An Indoor Collaborative Coefficient-Triangle APIT Localization Algorithm
نویسندگان
چکیده
The Approximate Point-In-Triangulation (APIT) localization algorithm is a widely used indoor positioning technology due to its simplicity and low power consumption. However, in practice, In-to-Out misjudgments exist regularly in APIT, and a considerable amount of nodes cannot be positioned due to the low node density. To tackle this issue, a Collaborative Coefficient-triangle APIT Localization (CCAL) algorithm is proposed. Firstly, an effective triangle criterion is put forward to reduce the probability of In-to-Out misjudgment and reduce the computational complexity. Then, a further Received Signal Strength Indicator (RSSI) location and weighted triangle coordinate calculation method is adopted to reduce the positioning error. Meanwhile, the idea of iterative collaborative positioning of the positioned unknown nodes is introduced to remarkably expand the localization coverage rate. Simulation results show that the proposed algorithm outperforms APIT, RSSI, and other improved algorithms in terms of both node location error and localization coverage rate.
منابع مشابه
On improving APIT algorithm for better localization in WSN
In Wireless Sensor Networks (WSNs), localization algorithms could be range-based or range-free. The Approximate Point in Triangle (APIT) is a range-free approach. We propose modification of the APIT algorithm and refer as modified-APIT. We select suitable triangles with appropriate distance between anchors to reduce PIT test errors (edge effect and non-uniform placement of neighbours) in APIT a...
متن کاملOn improving APIT algorithm for better localization in WSN
In Wireless Sensor Networks (WSNs), localization algorithms could be range-based or range-free. The Approximate Point in Triangle (APIT) is a range-free approach. We propose modification of the APIT algorithm and refer as modified-APIT. We select suitable triangles with appropriate distance between anchors to reduce PIT test errors (edge effect and non-uniform placement of neighbours) in APIT a...
متن کاملHTCRL: A Range-Free Location Algorithm Based on Homothetic Triangle Cyclic Refinement in Wireless Sensor Networks
Wireless sensor networks (WSN) have become a significant technology in recent years. They can be widely used in many applications. WSNs consist of a large number of sensor nodes and each of them is energy-constrained and low-power dissipation. Most of the sensor nodes are tiny sensors with small memories and do not acquire their own locations. This means determining the locations of the unknown...
متن کاملMap-merging in Multi-robot Simultaneous Localization and Mapping Process Using Two Heterogeneous Ground Robots
In this article, a fast and reliable map-merging algorithm is proposed to produce a global two dimensional map of an indoor environment in a multi-robot simultaneous localization and mapping (SLAM) process. In SLAM process, to find its way in this environment, a robot should be able to determine its position relative to a map formed from its observations. To solve this complex problem, simultan...
متن کاملVPIT: An Improved Range-Free Localization Algorithm Using Voronoi Diagrams for Wireless Sensor Networks
Localization systems have been identified as key issues in the development and operation of wireless sensor networks. The global positioning system (GPS) solves the problem about localization, but it is not suitable for wireless sensor networks. Due to range-free localization approaches requiring low equipped hardware and easy to implement, it is widely used in WSNs localization system. When th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Algorithms
دوره 10 شماره
صفحات -
تاریخ انتشار 2017